package org.lql.algo.codecrush.hot100.dynamicProgrammingMulti;

/**
 * @author: liangqinglong
 * @date: 2025-09-15 23:35
 * @description: 62. 不同路径 <a href="https://leetcode.cn/problems/unique-paths/description/?envType=study-plan-v2&envId=top-100-liked">...</a>
 **/
public class UniquePaths {

	public int uniquePaths(int m, int n) {
		int[][] dp = new int[m][n];
		for (int i = 0; i < m; i++) {
			dp[i][0] = 1;
		}
		for (int i = 0; i < n; i++) {
			dp[0][i] = 1;
		}
		for (int i = 1; i < m; i++) {
			for (int j = 1; j < n; j++) {
				dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
			}
		}
		return dp[m - 1][n - 1];
	}

	public static void main(String[] args) {
		UniquePaths uniquePaths = new UniquePaths();
		// 28
//		System.out.println(uniquePaths.uniquePaths(3, 7));
		// 3
		System.out.println(uniquePaths.uniquePaths(3, 2));
		// 28
		System.out.println(uniquePaths.uniquePaths(7, 3));
		// 6
		System.out.println(uniquePaths.uniquePaths(3, 3));
	}
}
